A Heuristic Algorithm for Plate SelectionThat Maximizes Compound Diversity
نویسندگان
چکیده
A heuristic algorithm was developed to maximize compound diversity within a subset of screening plates used in high throughput screening (HTS) to initiate the drug discovery process. The approach overcame the challenge of combinatorial explosion for selecting plate subsets with maximum compound diversity. The method yielded novel forms of plate-based diversity subsets (PBDS) for HTS screening in lead discovery. The algorithm, its validation and the application to our screening collection are outlined. (doi: 10.5562/cca2301)
منابع مشابه
A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملDetecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach
This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...
متن کاملSIMULTANOUS OPTIMIZATION OF SIZE AND CONNECTION ARRANGEMENT FOR LOW-RISE STEEL PLATE SHEAR WALL SYSTEMS
The present study is concerned with the simultaneous optimization of the size of components and the arrangement of connections for performance-based seismic design of low-rise SPSWs. Design variables include the size of beams and columns, the thickness of the infill panels, the type of each beam-to-column connection and the type of each infill-to-boundary frame connection. The objective functio...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کامل